نتایج جستجو برای: Leap Zagreb index

تعداد نتایج: 401811  

Journal: :Journal of Chemistry 2019

By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...

The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.

In a graph G, the first and second degrees of a vertex v is equal to thenumber of their first and second neighbors and are denoted by d(v/G) andd 2 (v/G), respectively. The first, second and third leap Zagreb indices are thesum of squares of second degrees of vertices of G, the sum of products of second degrees of pairs of adjacent vertices in G and the sum of products of firs...

Journal: :iranian journal of mathematical chemistry 2013
g. h. shirdel h. rezapour a. m. sayadi

let g be a simple connected graph. the first and second zagreb indices have been introducedas  vv(g)(v)2 m1(g) degg and m2(g)  uve(g)degg(u)degg(v) , respectively,where degg v(degg u) is the degree of vertex v (u) . in this paper, we define a newdistance-based named hyperzagreb as e uv e(g) .(v))2 hm(g)     (degg(u)  degg inthis paper, the hyperzagreb index of the cartesian product...

Journal: :iranian journal of mathematical chemistry 2016
b. basavanagoud s. patil

in this paper, the hyper - zagreb index of the cartesian product, composition and corona product of graphs are computed. these corrects some errors in g. h. shirdel et al.[11].

Journal: :Malaya Journal of Matematik 2018

Journal: :transactions on combinatorics 2015
ivan gutman muhammad kamran jamil naveed akhter

the first zagreb index $m_1$ of a graph $g$ is equal to the sum of squaresof degrees of the vertices of $g$. goubko proved that for trees with $n_1$pendent vertices, $m_1 geq 9,n_1-16$. we show how this result can beextended to hold for any connected graph with cyclomatic number $gamma geq 0$.in addition, graphs with $n$ vertices, $n_1$ pendent vertices, cyclomaticnumber $gamma$, and minimal $m...

Journal: :transactions on combinatorics 2016
nader habibi tayebeh dehghan zadeh ali reza ashrafi

the first zagreb index, $m_1(g)$, and second zagreb index, $m_2(g)$, of the graph $g$ is defined as $m_{1}(g)=sum_{vin v(g)}d^{2}(v)$ and $m_{2}(g)=sum_{e=uvin e(g)}d(u)d(v),$ where $d(u)$ denotes the degree of vertex $u$. in this paper, the firstand second maximum values of the first and second zagreb indicesin the class of all $n-$vertex tetracyclic graphs are presented.

Journal: :International Journal of Research in Advent Technology 2019

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید